error bursts造句

• The circuitry can correct error bursts up to 11 bits long.
• These patterns are called " error bursts ".
• The parameter " m " should be specified when describing an error burst.
• By means of bit-interleaving, the error bursts may be spread in time.
• The integer parameter " m " is referred to as the guard band of the error burst.
• The result is a CIRC that can completely correct error bursts up to 4000 bits, or about 2.5 mm on the disc surface.
• This code is so strong that most CD playback errors are almost certainly caused by tracking errors that cause the laser to jump track, not by uncorrectable error bursts.
• In the Hagelbarger code, inserted parity check bits are spread out in time so that an error burst is not likely to affect more than one of the groups in which parity is checked.
• An interleaver installed between the two decoders is used here to scatter error bursts coming from \ scriptstyle DEC _ 1 output . " DI " block is a demultiplexing and insertion module.
• Conversely, if a data stream is not characterized by error bursts or drop-outs but by random single bit errors, a Reed Solomon code is usually a poor choice compared to a binary code.
• As timecodes in analog systems are prone to bit-errors and drop-outs, most timecode processing devices check for internal consistency in the sequence of timecode values, and use simple error correction schemes to correct for short error bursts.
• It corrects error bursts up to 3, 500 bits in sequence ( 2.4 mm in length as seen on CD surface ) and compensates for error bursts up to 12, 000 bits ( 8.5 mm ) that may be caused by minor scratches.
• It corrects error bursts up to 3, 500 bits in sequence ( 2.4 mm in length as seen on CD surface ) and compensates for error bursts up to 12, 000 bits ( 8.5 mm ) that may be caused by minor scratches.
• This is because a CRC's ability to detect burst errors is based on proximity in the message polynomial M ( x ); if adjacent polynomial terms are not transmitted sequentially, a physical error burst of one length may be seen as a longer burst due to the rearrangement of bits.
• The choice for Reed-Solomon coding as the outer error correction code is based on the observation that the Viterbi decoder used for inner convolutional decoding produces short error bursts when there is a high concentration of errors, and Reed-Solomon codes are inherently well-suited to correcting bursts of errors.
• For many modern packet-switched communication systems, even a single uncorrected bit error is enough to cause the loss of a data packet by causing its CRC check to fail; whether that packet loss was caused by a single bit error or a hundred-bit-long error burst is irrelevant.
• One slight difference between the concatenated coding used by the DAB + system and that used on most other systems is that it uses a rectangular byte interleaver rather than Forney interleaving in order to provide a greater interleaver depth, which increases the distance over which error bursts will be spread out in the bit-stream, which in turn will allow the Reed-Solomon error decoder to correct a higher proportion of errors.